The Complexity of Diffuse Reflections in a Simple Polygon
نویسندگان
چکیده
The complexity of the visibility region formed by a point light source after k diffuse reflections in a simple n-sided polygon is O(n), which is the first result polynomial in n, with no dependence on k. This bound is an exponential improvement over the previous bound of O(n2d(k+1)/2e+1) due to Prasad et al. [8].
منابع مشابه
Directly Visible Pairs and Illumination by Reflections in Orthogonal Polygons
We consider direct visibility in simple orthogonal polygons and derive tight lower and upper bounds on the number of strictly internal and external visibility edges. We also show a lower bound of ⌈n2 ⌉ − 1 on the number of diffuse reflections required for completely illuminating an orthogonal polygon from an arbitrary point inside it. Further, we derive lower bounds on the combinatorial complex...
متن کاملOn multiple connectedness of regions visible due to multiple diffuse reflections
It is known that the region V (s) of a simple polygon P , directly visible (illuminable) from an internal point s, is simply connected. Aronov et al. [2] established that the region V1(s) of a simple polygon visible from an internal point s due to at most one diffuse reflection on the boundary of the polygon P , is also simply connected. In this paper we establish that the region V2(s), visible...
متن کاملDiffuse reflection diameter in simple polygons
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the maximum number of diffuse reflections needed for a point light source to illuminate the interior of a simple polygon with n walls is bn/2c − 1. Light reflecting diffusely leaves a surface in all directions, rather than at an identical angle as with specular reflections.
متن کاملDiffuse Reflections in Simple Polygons
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the maximum number of diffuse reflections needed for a point light source to illuminate the interior of a simple polygon with n walls is bn/2c − 1. Light reflecting diffusely leaves a surface in all directions, rather than at an identical angle as with specular reflections.
متن کاملAn Algorithm for Computing Constrained Reflection Paths in Simple Polygon
Let s be a source point and t be a destination point inside an n-vertex simple polygon P . Euclidean shortest paths [Lee and Preparata, Networks, 1984; Guibas et al. , Algorithmica, 1987] and minimum-link paths [Suri, CVGIP, 1986; Ghosh, J. Algorithms, 1991] between s and t inside P have been well studied. Both these kinds of paths are simple and piecewise-convex. However, computing optimal pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006